Evaluation of Scheduling Policies in a Staged-Database System
نویسندگان
چکیده
Traditional database systems execute queries using one query multiple operators approach. Such systems do not cash on the common data or computation which could be used by multiple queries. Thus leading to poor performance. To overcome these deficiencies, Staged-DB approach has been proposed, where the philosophy is one operator multiple queries. A Staged-DB system splits a traditional DBMS into a number of stages and handles a stage independently. In this project we evaluate the performance of a Staged-DB system under different scheduling policies. Our study is limited to scheduling various components that constitute the execution stage of a Staged-DB. We evaluate different scheduling policies that fix the order in which various operators in the execution stage should be executed. We demonstrate the performance of the policies in terms of response time, throughput, and memory consumption. General Terms Database management systems
منابع مشابه
Affinity Scheduling in Staged Server Architectures
Modern servers typically process request streams by assigning a worker thread to a request, and rely on a round robin policy for context-switching. Although this programming paradigm is intuitive, it is oblivious to the execution state and ignores each software module’s affinity to the processor caches. As a result, resumed threads of execution suffer additional delays due to conflict and compu...
متن کاملAffinity Scheduling in Staged Server Architectures (CMU-CS-02-113)
Modern servers typically process request streams by assigning a worker thread to a request, and rely on a round robin policy for context-switching. Although this programming paradigm is intuitive, it is oblivious to the execution state and ignores each software module’s affinity to the processor caches. As a result, resumed threads of execution suffer additional delays due to conflict and compu...
متن کاملA Performance Study of Locking Granularity in Shared-Nothing Parallel Database Systems
Locking granularity refers to the size of a lockable data unit, called a "granule", in a database system. Fine granularity improves system performance by increasing concurrency level but it also increases lock management overhead. Coarse granularity, on the other hand, sacrifices system performance but lowers the lock management cost. This paper explores the impact of granule size on performanc...
متن کاملPerformance Evaluation on a Real-Time Database
We have implemented an object-oriented real-time database system called BeeHive. Using BeeHive, the performance of two data-deadline cognizant scheduling policies, called EDDF and EDF-DC, and a baseline EDF policy all with/without admission control are evaluated through extensive experiments. We identify the ranges where data-deadline cognizant scheduling policies are effective. We also show th...
متن کاملModeling and Availability Analysis of Internet Data Center with various Maintenance Policies
In this paper, the authors have focused on the stochastic analysis of an internet data center (IDC), which consists of a database main server connected to a redundant server. Observing the different possibilities of functioning of the system, analysis has been done to evaluate the various reliability characteristics of the system. The system can completely fail due to failure of redundant serve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007